منابع مشابه
Computing Majority with Triple Queries
Consider a bin containing n balls colored with two colors. In a k-query, k balls are selected by a questioner and the oracle’s reply is related (depending on the computation model being considered) to the distribution of colors of the balls in this k-tuple; however, the oracle never reveals the colors of the individual balls. Following a number of queries the questioner is said to determine the...
متن کاملComputing majority with low-fan-in majority queries
In this paper we examine the problem of computing majority functionMAJn on n bits by depthtwo formula, where each gate is a majority function on at most k inputs. We present such formula that gives the first nontrivial upper bound for this problem, with k = 2 3n + 4. This answers an open question in [7]. We also look at this problem in adaptive setting — when we are allowed to query for value o...
متن کاملEncodings for Range Majority Queries
We face the problem of designing a data structure that can report the majority within any range of an array A[1, n], without storing A. We show that Ω(n) bits are necessary for such a data structure, and design a structure using O(n log∗ n) bits that answers majority queries in O(logn) time. We extend our results to τ -majorities.
متن کاملComputing power indices in weighted multiple majority games
The Shapley-Shubik power index in a voting situation depends on the number of orderings in which each player is pivotal. The Banzhaf power index depends on the number of ways in which each voter can e¤ect a swing. If the input size of the problem is n, then the function which measures the worst case running time for computing these indices is in O (n2) : We present a method based on generating ...
متن کاملComputing Iceberg Queries Eeciently
Many applications compute aggregate functions over an attribute (or set of attributes) to nd aggregate values above some speci ed threshold. We call such queries iceberg queries, because the number of abovethreshold results is often very small (the tip of an iceberg), relative to the large amount of input data (the iceberg). Such iceberg queries are common in many applications, including data w...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2014
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2014.04.020